三峡升船机平衡重滑轮结构拓扑优化设计

为了解决三峡升船机平衡重滑轮腔体内焊接支撑块脱落导致异响问题,建立了以结构柔度最小为优化目标的拓扑优化模型,基于ANSYS对滑轮结构进行拓扑优化设计并对模型进行重构,得到了最终优化模型。对比分析了优化前后结果,表明优化后的滑轮总重与优化前的比值为0.91,所受最大应力比值0.852,所受最大位移比值0.94。通过优化结果精确指导其结构设计,确定加工孔径的位置和大小,取出了腔体内脱落支撑块。     

神威E级原型机互连网络和消息机制

本文描述了神威E级原型机的互连网络和消息机制.神威E级原型机是继神威蓝光、神威·太湖之光之后神威家族的第三代计算机.该计算机作为一台E级计算机的原型机,峰值性能3.13 PFlops,其最大的特色之一就是采用28 Gbps传输技术,设计开发了新一代的神威高阶路由器和神威高性能网络接口两款芯片,在传统胖树的基础上,设计了双轨泛树拓扑结构,定义实现了新颖的神威消息原语和消息库,实现了一种基于包级粒度动态切换的双轨乱序消息机制,通信性能比神威·太湖之光互连网络提升了4倍,为神威E级计算机互连网络的研制奠定了基础.     

Layout Optimization for Greenhouse WSN Based on Path Loss Analysis

When wireless sensor networks (WSN) are deployed in the vegetable greenhouse with dynamic connectivity and interference environment, it is necessary to increase the node transmit power to ensure the communication quality, which leads to serious network interference. To offset the negative impact, the transmit power of other nodes must also be increased. The result is that the network becomes worse and worse, and node energy is wasted a lot. Taking into account the irregular connection range in the cucumber greenhouse WSN, we measured the transmission characteristics of wireless signals under the 2.4 Ghz operating frequency. For improving network layout in the greenhouse, a semi-empirical prediction model of signal loss is then studied based on the measured data. Compared with other models, the average relative error of this semi-empirical signal loss model is only 2.3%. Finally, by combining the improved network topology algorithm and tabu search, this paper studies a greenhouse WSN layout that can reduce path loss, save energy, and ensure communication quality. Given the limitation of node-degree constraint in traditional network layout algorithms, the improved algorithm applies the forwarding constraint to balance network energy consumption and constructs asymmetric network communication links. Experimental results show that this research can realize the energy consumption optimization of WSN layout in the greenhouse.     

融合物品相似性与流形正则化的矩阵分解推荐模型

矩阵分解是推荐系统中应用最为广泛的方法之一,但其对物品隐因子及其相似性学习不够充分.社会网络分析中认为相互连接的个体有一定共性,受此启发提出一个能够借助近邻关系有效学习物品隐因子及其相似性的矩阵分解推荐模型.首先基于评分矩阵对物品相似性计算进行改良,综合同一用户和相似用户的评分共现信息对物品信息建模;然后通过构建相似性优化和流形局部保持正则化项,使物品相似性作用在矩阵分解中,从而充分学习物品隐因子特征及其相似性;最后根据用户和物品隐因子矩阵计算推荐指数.在公开数据集上的实验结果表明,通过流形正则化技术将改良的物品相似性作用在矩阵分解中,可以有效提升推荐效果.     

基于时空融合图网络学习的视频异常事件检测

视频中异常事件所体现的时空特征存在着较强的相关关系.针对视频异常事件发生的时空特征相关性而影响检测性能问题,提出了基于时空融合图网络学习的视频异常事件检测方法,该方法针对视频片段的特征分别构建空间相似图和时间连续图,将各片段对应为图中的节点,考虑各节点特征与其他节点特征的Top-k相似性动态形成边的权重,构成空间相似图;考虑各节点的m个时间段内的连续性形成边的权重,构成时间连续图.将空间相似图和时间连续图进行自适应加权融合形成时空融合图卷积网络,并学习生成视频特征.在排序损失中加入图的稀疏项约束降低图模型的过平滑效应并提升检测性能.在UCF-Crime和ShanghaiTech等视频异常事件数据集上进行了实验,以接收者操作曲线(receiver operating characteristic curve,ROC)以及曲线下面积(area under curve,AUC)值作为性能度量指标.在UCF-Crime数据集下,提出的方法在AUC上达到80.76%,比基准线高5.35%;在ShanghaiTech数据集中,AUC达到89.88%,比同类最好的方法高5.44%.实验结果表明:所提出的方法可有效提高视频异常事件检测的性能.     

一种提高僵尸网络鲁棒性的对等网络拓扑结构

通过对现有的基于P2P技术的僵尸网络进行综述,通过研究分析发现,现有的P2P技术已不能满足僵尸网络的需求,为此我们在充分借鉴非结构化对等协议、结构化对等协议的基础上,提出了一种具有新型拓扑结构的对等网络协议AATP。经过实验表明,AATP具有良好的抗网络波动性。     

紧凑型边界扫描技术的功能与现状

芯片一体化进程的加剧以及对功耗控制的关注日益增加,边界扫描技术面临新的挑战,这些挑战来源于调试、应用、测试等方面,紧凑型边界扫描技术对此提出了有效的解决方法;以IEEE1149.7标准以及国内外文献报道为依据,对精简引脚与增强功能边界扫描技术的测试规范进行系统的分析,重点对该技术的新功能、新特性和新应用进行详细介绍;针对符合IEEE1149.1标准的测试系统与被测系统如何升级以实现IEEE1149.7标准新功能的问题提出了相应的建议;最后总结了该技术的发展方向和应用前景。     

SVM-based ontology matching approach

There are a lot of heterogeneous ontologies in semantic web, and the task of ontology mapping is to find their semantic relationship. There are integrated methods that only simply combine the similarity values which are used in current multi-strategy ontology mapping. The semantic information is not included in them and a lot of manual intervention is also needed, so it leads to that some factual mapping relations are missed. Addressing this issue, the work presented in this paper puts forward an ontology matching approach, which uses multi-strategy mapping technique to carry on similarity iterative computation and explores both linguistic and structural similarity. Our approach takes different similarities into one whole, as a similarity cube. By cutting operation, similarity vectors are obtained, which form the similarity space, and by this way, mapping discovery can be converted into binary classification. Support vector machine (SVM) has good generalization ability and can obtain best compromise between complexity of model and learning capability when solving small samples and the nonlinear problem. Because of the said reason, we employ SVM in our approach. For making full use of the information of ontology, our implementation and experimental results used a common dataset to demonstrate the effectiveness of the mapping approach. It ensures the recall ration while improving the quality of mapping results.     

Distributed match-making

In many distributed computing environments, processes are concurrently executed by nodes in a store- and-forward communication network. Distributed control issues as diverse as name server, mutual exclusion, and replicated data management involve making matches between such processes. We propose a formal problem called distributed match-making as the generic paradigm. Algorithms for distributed match-making are developed and the complexity is investigated in terms of messages and in terms of storage needed. Lower bounds on the complexity of distributed match-making are established. Optimal algorithms, or nearly optimal algorithms, are given for particular network topologies.The work of the second author was supported in part by the Office of Naval Research under Contract N00014-85-K-0168, by the Office of Army Research under Contract DAAG29-84-K-0058, by the National Science Foundation under Grant DCR-83-02391, and by the Defence Advanced Research Projects Agency (DARPA) under Contract N00014-83-K-0125. Current address of both authors: CWI, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands.